Merging Qualitative Constraints Networks Using Propositional Logic
نویسندگان
چکیده
In this paper we address the problem of merging qualitative constraints networks (QCNs). We propose a rational merging procedure for QCNs. It is based on translations of QCNs into propositional formulas, and take advantage of propositional merging operators.
منابع مشابه
A Framework for Merging Qualitative Constraints Networks
Spatial or temporal reasoning is an important task for many applications in Artificial Intelligence, such as space scheduling, navigation of robots, etc. Several qualitative approaches have been proposed to represent spatial and temporal entities and their relations. These approaches consider the qualitative aspects of the space relations only, disregarding any quantitative measurement. In some...
متن کاملMerging Knowledge Bases in Possibilistic Logic by Lexicographic Aggregation
Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and dealing with uncertainty. They often result in a possibilistic knowledge base which is a...
متن کاملBayesian Logic Programs
Bayesian networks provide an elegant formalism for representing and reasoning about uncertainty using probability theory. They are a probabilistic extension of propositional logic and, hence, inherit some of the limitations of propositional logic, such as the difficulties to represent objects and relations. We introduce a generalization of Bayesian networks, called Bayesian logic programs, to o...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملFirst-Order Belief Merging using Dilations
The aim of belief merging is to merge conflicting information while preserving as much of it as possible. Most proposals in the literature work with knowledge bases expressed in propositional logic. We propose a new framework for merging knowledge bases expressed in (subsets of) first-order logic. Dilation operators (a concept originally introduced by Bloch and Lang) are employed and developed,...
متن کامل